Dependent Arising and the Emptiness of Emptiness: Why Did Nagarjuna Start with Causation?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Emptiness and relativity

1 Relativity and interactivity The Buddhist principle that all is empty is understood by some as the principle that all is relative [Thurman (1993)]. This universal relativity principle is more embracing though less structured than Einstein’s general relativity principle, which still admits many absolutes. It is worth considering seriously. A philosophical argument for a universal relativity co...

متن کامل

Context, Collectivity and Emptiness

The paper investigates a dynamic alternative to plural e-type strategies, which is general enough to model the truth-conditional as well as the dynamic aspects of both increasing and non-increasing quantifiers. It combines two proposals for plural dynamic semantics: (i) atom predication denotes a set of assignments and set predication denotes a set of sets of assignments and (ii) a witness cond...

متن کامل

Tathāgatagarbha, Emptiness, and Monism

The tathāgatagarbha doctrine is one of the most significant Buddhist doctrines to have come under the scrutiny of scholars in recent times. One of the more interesting aspects of this doctrine is that it focuses attention on the nature of the Buddhist “absolute” or highest truth in such a way as to make clear many of the problems and concerns of the Buddhist community after the advent of the do...

متن کامل

Emptiness Problems for Distributed Automata

We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite sequence of synchronous rounds. The problem is shown to be decidable in LOGSPACE for a class of forgetful automata, where the nodes see the messages received from...

متن کامل

Emptiness Problems for Integer Circuits

We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. For most settings of allowed operations we precisely characterize the complexity in terms of completeness for classes like NL, NP, and PSPACE. The case where intersection, addition, and multiplication is allowed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Philosophy East and West

سال: 1994

ISSN: 0031-8221

DOI: 10.2307/1399593